A Note on Natural Extensions in Abstract Algebraic Logic

نویسندگان

  • Petr Cintula
  • Carles Noguera
چکیده

Transfer theorems are central results in abstract algebraic logic that allow to generalize properties of the lattice of theories of a logic to any algebraic model and its lattice of filters. Their proofs sometimes require the existence of a natural extension of the logic to a bigger set of variables. Constructions of such extensions have been proposed in particular settings in the literature. In this paper we show that these constructions need not always work and propose a wider setting (including all finitary logics and those with countable language) in which they can still be used.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A note on semi-regular locales

Semi-regular locales are extensions of the classical semiregular spaces. We investigate the conditions such that semi-regularization is a functor. We also investigate the conditions such that semi-regularization is a reflection or coreflection.

متن کامل

On the compactness property of extensions of first-order G"{o}del logic

We study three kinds of compactness in some variants of G"{o}del logic: compactness,entailment compactness, and approximate entailment compactness.For countable first-order underlying language we use the Henkinconstruction to prove the compactness property of extensions offirst-order g logic enriched by nullary connective or the Baaz'sprojection connective. In the case of uncountable first-orde...

متن کامل

Equality propositional logic and its extensions

We introduce a new formal logic, called equality propositional logic. It has two basic connectives, $boldsymbol{wedge}$ (conjunction) and $equiv$ (equivalence). Moreover, the $Rightarrow$ (implication) connective can be derived as $ARightarrow B:=(Aboldsymbol{wedge}B)equiv A$. We formulate the equality propositional logic and demonstrate that the resulting logic has reasonable properties such a...

متن کامل

Generalized Horn Clause Programs

This paper considers, in a general setting, an axiomatic basis for Horn clause logic programming. It characterizes a variety of \Horn-clause-like" computations, arising in contexts such as deductive databases, various abstract interpretations, and extensions to logic programming involving E-uniication, quantitative deduction, and inheritance, in terms of two simple operators , and discusses alg...

متن کامل

Malinowski modalization, modalization through fibring and the Leibniz hierarchy

We show how various modal systems considered by Malinowski as extensions of classical propositional calculus may be obtained as fibrings of classical propositional calculus and corresponding implicative modal logics, using the fibring framework for combining logics of Fernández and Coniglio. Taking advantage of this construction and known results of Malinowski, we draw some useful conclusions c...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Studia Logica

دوره 103  شماره 

صفحات  -

تاریخ انتشار 2015